Achieving Multidimensional K-Anonymity by a Greedy Approach
نویسندگان
چکیده
Protecting privacy in microdata publishing is K-Anonymity, Here recoding “models” have been considered for achieving k anonymity[1,2]. We proposes a new multidimensional model, which gives high flexibility. Often this flexibility leads to higher-quality anonymizations, as measured both by general-purpose metrics and more specific notions of query answerability. Like previous multidimensional models anonymization is NP-hard. However, we introduce a simple greedy approximation algorithm, It leads to more desirable anonymizations than single-dimensional
منابع مشابه
Achieving Multidimensional K-Anonymity by a Greedy Approach
Protecting privacy in microdata publishing is K-Anonymity, Here recoding “models” have been considered for achieving k anonymity[1,2]. We proposes a new multidimensional model, which gives high flexibility. Often this flexibility leads to higher-quality anonymizations, as measured both by generalpurpose metrics and more specific notions of query answerability. Like previous multidimensional mod...
متن کاملMultidimensional K-Anonymity
K-Anonymity has been proposed as a mechanism for privacy protection in microdata publishing, and numerous recoding “models” have been considered for achieving kanonymity. This paper proposes a new multidimensional model, which provides an additional degree of flexibility not seen in previous (single-dimensional) approaches. Often this flexibility leads to higher-quality anonymizations, as measu...
متن کاملA Clustering Approach for Achieving Data Privacy
New privacy regulations together with everincreasing data availability and computational power have created a huge interest in data privacy research. One major research direction is built around k-anonymity property and its extensions, which are required for the released data. In this paper we present such an extension to k-anonymity, called psensitive k-anonymity, which solves some of the weak...
متن کاملAchieving k-anonymity Using Improved Greedy Heuristics for Very Large Relational Databases
Advances in data storage, data collection and inference techniques have enabled the creation of huge databases of personal information. Dissemination of information from such databases even if formally anonymised, creates a serious threat to individual privacy through statistical disclosure. One of the key methods developed to limit statistical disclosure risk is k-anonymity. Several methods ha...
متن کاملPrivacy-preserving data mining: A feature set partitioning approach
In privacy-preserving data mining (PPDM), a widely used method for achieving data mining goals while preserving privacy is based on k-anonymity. This method, which protects subject-specific sensitive data by anonymizing it before it is released for data mining, demands that every tuple in the released table should be indistinguishable from no fewer than k subjects. The most common approach for ...
متن کامل